Exploiting Structural Similarities in a BDD-Based Verification Method
نویسندگان
چکیده
A major challenge in the area of hardware veriication is to devise methods that can handle circuits of practical size. This paper intends to show how the applicability of combinational circuit veriication tools based on binary decision diagrams (BDDs) can be greatly improved. The introduction of dynamic variable ordering techniques already makes these tools more robust; a designer no longer needs to worry about a good initial variable order. In addition, we present a novel approach combining BDDs with a technique that exploits structural similarities of the circuits under comparison. We explain how these similarities can be detected and put to eeective use in the veriication process. Benchmark results show that the proposed method signiicantly extends the range of circuits that can be veriied using BDDs.
منابع مشابه
Formal Verification on the RT Level Computing One-To-One Design Abstractions by Signal Width Reduction
Digital circuit designs are usually given as RegisterTransfer-Level (RTL) specifications, but most of today’s hardware verification tools are based on bit-level methods, using SAT or BDD-based techniques. RTL specifications contain more explicite structural information than bit-level descriptions. This paper presents a new approach to scale down design sizes before verification by exploiting wo...
متن کاملAdvanced Unbounded CTL Model Checking By Using AIGs, BDD Sweeping, and Quantifier Scheduling
In this paper we present a complete method for verifying properties expressed in the temporal logic CTL. In contrast to the majority of verification methods presented in recent years, we support unbounded model checking based on symbolic representations of characteristic functions. Among others, our method is based on an advanced And-Inverter Graph (AIG) implementation, quantifier scheduling, a...
متن کاملSymbolic Model Checking with Isomorphism Exploiting Transition Relations
Symbolic model checking by using BDDs has greatly improved the applicability of model checking. Nevertheless, BDD based symbolic model checking can still be very memory and time consuming. One main reason is the complex transition relation of systems. Sometimes, it is even not possible to generate the transition relation, due to its exhaustive memory requirements. To diminish this problem, the ...
متن کاملExploiting Target Enlargement and Dynamic Abstraction within Mixed BDD and SAT Invariant Checking
In this paper, we propose a methodology to make Binary Decision Diagrams (BDDs) and Boolean Satisfiability (SAT) Solvers cooperate. The underlying idea is simple: We start a verification task with BDDs, we go on with them as long as the problem remains of manageable size, then we switch to SAT, without losing the work done on the BDD domain. We propose target enlargement as an attempt to bring ...
متن کاملSAT Modulo BDD -- A Combined Verification Approach for Incomplete Designs
We introduce a novel method that integrates BDD-based symbolic model checking into SAT-based bounded model checking in the presence of unknowns. By incorporating both distinctively different methods, our new hybrid verification tool can take advantage of what each type of model checking has to offer. We present a case study for which both the BDD-based method as well as the SAT-based method are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994